Research on Circular Area Search algorithm of multi-robot service based on SOA cloud platform

Considering autonomous mobile robots with a variety of specific functions as a kind of service, when there are many types and quantities of services and the density of regional services is large, proposing an algorithm of Circular Area Search (CAS) because of the problem of multi-robot service scheduling in various areas. Firstly, Django is used as the web framework to build the Service-Oriented Architecture (SOA) multi-robot service cloud platform, which is the basic platform for multi-service combination. Then, the service type, the latitude and longitude and the scoring parameters of the service are selected as the service search metrics to design the CAS algorithm that based on the existing service information registered in MySQL and the Gaode Map for screening optimal service, and then providing the service applicant with the best service. Finally, the service applicant applies for the self-driving tour service as an example to perform performance simulation test on the proposed CAS algorithm. The results show that the CAS algorithm of the multi-robot service cloud platform proposed in this paper is practical compared to the global search. And compared with the Greedy Algorithm experiment, the service search time is reduced about 58% compared with the Greedy Algorithm, which verifies the efficiency of CAS algorithm.     

基于Web的科技信息管理系统

介绍了在Internet/Intranet上开发基于Web技术的科技信息管理系统。重点对系统核心技术进行了论述。     

Internet中文信息搜索引擎评析

介绍搜索引擎的分类、对比和查询技巧。     

国内电子商务门户网站的现状研究

从电子商务在我国迅速发展的角度出发，系统地介绍了我国电子商务网站的典范：阿里巴巴、淘宝。从电子商务的模式出发分析了其经营理念，成功因素及其不足，对中国的电子商务目前状况作了分析，并提出展望。     

Breaking the search space symmetry in partitioning problems: An application to the graph coloring problem

Many problems consist in splitting a set of objects into different groups so that each group verifies some properties. In practice, a partitioning is often encoded by an array mapping each object to its group numbering. In fact, the group number of an object does not really matter, and one can simply rename each group to obtain a new encoding. That is what we call the symmetry of the search space in a partitioning problem. This property may be prejudicial for optimization methods such as evolutionary algorithms (EA) which require some diversity during the search.     

运动估计块匹配两级搜索算法

根据视频图像相邻块在空间上具有很大的相关性,吸收了矢量预测块匹配的核心思想,提出一种两级块匹配运动估计算法,在第一级中,首先根据矢量预测确定一个小区域,然后在此区域内进行快速搜索,如果在第一级中没有搜索到匹配块则进行第二级搜索,该算法可大大提高搜索速度.     

基于水印技术的数字作品版权保护系统

本文基于数字水印技术提出了一种网络多媒体作品的注册和侵权收集机制,可以实现包括图像、视频和音频等网络作品的注册和非授权复制和传播行为的信息收集等功能。该机制对网络多媒体作品的版权保护具有一定的实用价值。     

非传统信息安全下的搜索引擎

搜索引擎已成为当今人们上网获取信息所不可缺少的一种手段,在得到自己所需要信息的同时也在暴露着自己的行踪,从而引出了保护个人隐私的大讨论。本文利用社会工程学原理从非传统信息安全角度分析,以通过QQ号入手,利用现有的搜索引擎的例子,来揭示搜索引擎在非传统信息安全下带来的危害,阐明社会工程学原理对非传统信息安全的重大影响,并提出相应的防范对策。     

Proactive replication for rare objects in unstructured peer-to-peer networks

Unstructured peer-to-peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. The search efficiency problem in unstructured P2P networks has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve search efficiency for rare objects. It uses an object-probing technique for peers to decide whether or not to establish replications for their objects when they join the network. This strategy can effectively increase the popularity of rare objects in order to enhance search efficiency. We also present a rare object search algorithm to reduce the overhead caused by the replication strategy. When a peer forwards a search request, the forward probability is calculated according to its neighbors' degrees and the number of neighbors' objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that our proactive replication strategy greatly improves search efficiency for rare objects with moderate communication overhead. The rare object search algorithm not only improves search efficiency for rare objects, but also achieves load balance in search.     

基于Newsvendor型产品特性的FJSP问题研究

针对新时代环境下Newsvendor型产品销售期短、期末未出售产品价值递减的产品特点,生产链要求位于上游的供应商必须快速加工出所需的工件,否则将面临着线性递增的拖期惩罚。在面对基于Newsvendor型产品的柔性作业车间调度问题时,设计了一种加入禁忌搜索的混合遗传算法,扩大了解的搜索范围,避免了传统遗传算法容易陷于局部最优的缺陷。最后利用混合遗传算法对一个仿真案例进行求解。